A Robust Adaptive Beamformer Based on Semidefinite Programming with Quadratic Constraints
نویسندگان
چکیده
A robust beamforming with quadratic constraints, formulated as a semidefinite programming (SDP) problem, is proposed in this paper. With this formulation, the constraints on magnitude response can be easily imposed on the adaptive beamformer. And the non-convex quadratic constraints can be transformed into linear constraints. Therefore, the proposed method can be robust against the steering direction error. In practice, there are many array imperfections except steering direction error. In order to resist all kinds of array imperfections, the adaptive beamformer based on worst-case optimization technique is proposed by minimizing the array output power with respect to the worst-case array imperfections. Simulation results demonstrate that the proposed method is effective and can achieve a better performance.
منابع مشابه
Robust Adaptive Beamforming Based on Steering Vector Estimation via Semidefinite Programming Relaxation
We develop a new approach to robust adaptive beamforming in the presence of signal steering vector errors. Since the signal steering vector is known imprecisely, its presumed (prior) value is used to find a more accurate estimate of the actual steering vector, which then is used for obtaining the optimal beamforming weight vector. The objective for finding such an estimate of the actual signal ...
متن کاملMagnitude Constraint Minimum Variance Beamformer with Conjugate Symmetric Constraint and Norm Constraint
In this paper, an improved robust minimum variance beamformer against direction of arrival (DOA) mismatch and finite sample effect is proposed. Multiple inequality magnitude constraints are imposed to broaden the main lobe of beampattern. The conjugate symmetric structure of the optimal weight is utilized to transform the non-convex inequality magnitude constraints into convex ones. A quadratic...
متن کاملNull broadening adaptive beamforming based on covariance matrix reconstruction and similarity constraint
In this paper, a procedure for the null broadening algorithm design with respect to the nonstationary interference is proposed. In contrast to previous works, we first impose nulls toward the regions of the nonstationary interference based on the reconstruction of the interference-plus-noise covariance matrix. Additionally, in order to provide a restriction on the shape of the beam pattern, a s...
متن کاملRobust Semidefinite Programming∗
In this paper, we consider semidefinite programs where the data is only known to belong to some uncertainty set U . Following recent work by the authors, we develop the notion of robust solution to such problems, which are required to satisfy the (uncertain) constraints whatever the value of the data in U . Even when the decision variable is fixed, checking robust feasibility is in general NP-h...
متن کاملRobust Control via Sequential Semidefinite
This paper discusses nonlinear optimization techniques in robust control synthesis, with special emphasis on design problems which may be cast as minimizing a linear objective function under linear matrix inequality (LMI) constraints in tandem with nonlinear matrix equality constraints. The latter type of constraints renders the design numerically and algorithmically difficult. We solve the opt...
متن کامل